Pseudo-Random Key Stream Generation Algorithm for Encryption Purposes
نویسندگان
چکیده
منابع مشابه
A Public-Key Encryption Scheme with Pseudo-random Ciphertexts
This work presents a practical public-key encryption scheme that offers security under adaptive chosen-ciphertext attack (CCA) and has pseudo-random ciphertexts, i.e. ciphertexts indistinguishable from random bit strings. Ciphertext pseudo-randomness has applications in steganography. The new scheme features short ciphertexts due to the use of elliptic curve cryptography, with ciphertext pseudo...
متن کاملImage Encryption Based on Pixel Shuffling and Random Key Stream
Secured data storage and transmission has become an important issue in the digital world due to the increased use of Internet for communication purposes. Information security is becoming more important as the amount of sensitive data being exchanged on the Internet increases. The services like confidentiality and data integrity are required to protect data against unauthorized usage and modific...
متن کاملKey Generation Using Genetic Algorithm for Image Encryption
Cryptography is essential for protecting information as the importance of security is increasing day by day with the advent of online transaction processing and e commerce. Now a day the security of digital images are major area of concern, especially when we deal with digital images where it may be stored or send through the communication channel. Genetic algorithms are a class of optimization...
متن کاملImproved Key Generation Algorithm for Gentry's Fully Homomorphic Encryption Scheme
Abstract. At EUROCRYPT 2011, Gentry and Halevi implemented a variant of Gentry’s fully homomorphic encryption scheme. The core part in their key generation is to generate an odd-determinant ideal lattice having a particular type of Hermite Normal Form. However, they did not give a rigorous proof for the correctness. We present a better key generation algorithm, improving their algorithm from tw...
متن کاملA Pseudo-Random Encryption Mode
Block ciphers are length-preserving private-key encryption schemes. I.e., the private key of a block-cipher determines a permutation on strings of the length of its input. This permutation is used for encryption while the inverse permutation is used for decryption. Using a length-preserving encryption scheme saves on memory and prevents wasting communication bandwidth. Furthermore, it enables t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Chaotic Computing
سال: 2020
ISSN: 2046-3359
DOI: 10.20533/ijcc.2046.3359.2020.0024